A multilevel unsymmetric matrix ordering algorithm for parallel process simulation
نویسندگان
چکیده
منابع مشابه
A Parallel Algorithm for Multilevel Graph Partitioning and Sparse Matrix Ordering
In this paper we present a parallel formulation of the multilevel graph partitioning and sparse matrix ordering algorithm. A key feature of our parallel formulation (that distinguishes it from other proposed parallel formulations of multilevel algorithms is that it partitions the vertices of the graph into √ p parts while distributing the overall adjacency matrix of the graph among all p proces...
متن کاملAn Approach for Parallelizing any General Unsymmetric Sparse Matrix Algorithm
In many large scale scientiic and engineering computations, the solution to a sparse linear system is required. We present a partial unsymmetric nested dissection method that can be used to parallelize any general unsymmetric sparse matrix algorithm whose pivot search can be restricted to a subset of rows and columns in the active submatrix. The submatrix is determined by the partial unsymmetri...
متن کاملUnsymmetric Ordering Using A Constrained Markowitz Scheme
We consider the LU factorization of unsymmetric sparse matrices using a threephase approach (analysis, factorization and triangular solution). Usually the analysis phase first determines a set of potentially good pivot and then orders this set of pivots to decrease the fill-in in the factors. In this paper, we present a preprocessing algorithm that simultaneously achieves the objectives of sele...
متن کاملTwo-stage ordering for unsymmetric parallel row-by-row frontal solvers
The row-by-row frontal method may be used to solve general large sparse linear systems of equations. By partitioning the matrix into (nearly) independent blocks and applying the frontal method to each block, a coarse-grained parallel frontal algorithm is obtained. The success of this approach depends on preordering the matrix. This can be done in two stages, (1) order the matrix to bordered blo...
متن کاملMatrix Ordering Strategies for Process Engineering: Graph Partitioning Algorithms for Parallel Computation
The solution of large-scale chemical process simulation and optimization problems using parallel computation requires algorithms that can take advantage of multiprocessing when solving the large, sparse matrices that arise. Parallel algorithms require that the matrices be partitioned in order to distribute computational work across processors. One way to accomplish this is to reorder the matrix...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computers & Chemical Engineering
سال: 2000
ISSN: 0098-1354
DOI: 10.1016/s0098-1354(99)00314-2